On propositional, truth and Boolean functions.
نویسندگان
چکیده
منابع مشابه
Representing Boolean Functions with Propositional Directed Acyclic Graphs
Propositional directed acyclic graphs (PDAG) continue the line of research on knowledge compilation in the context of Negational Normal Forms (NNF) and Binary Decision Diagrams (BDD). This paper summarizes previous results and open problems concerning knowledge representation based on PDAG and its sub-languages. In addition, it gives a short introduction to some application areas.
متن کاملComplexity of Propositional Abduction for Restricted Sets of Boolean Functions
Abduction is a fundamental and important form of nonmonotonic reasoning. Given a knowledge base explaining how the world behaves it aims at finding an explanation for some observed manifestation. In this paper we focus on propositional abduction, where the knowledge base and the manifestation are represented by propositional formulae. The problem of deciding whether there exists an explanation ...
متن کاملRelativism, the Open Future, and Propositional Truth
F. Correia and A. Iacona (eds.), Around the Tree: Semantic and Metaphysical Issues Concerning Branching and the Open Future, Synthese Library 361, DOI 10.1007/978-94-007-5167-5_1, © Springer Science+Business Media Dordrecht 2013 Abstract In his paper “Future Contingents and Relative Truth,” John MacFarlane argues for truth relativism on the basis of the possibility of the open future. He defend...
متن کاملOn canalizing Boolean functions
Boolean networks are an important model of gene regulatory networks in systems and computational biology. Such networks have been widely studied with respect to their stability and error tolerance. It has turned out that canalizing Boolean functions and their subclass, the nested canalizing functions, appear frequently in such networks. These classes have been shown to have a stabilizing effect...
متن کاملBoolean Programs and Quantified Propositional Proof Systems
Definition: A proof system is a feasible (i.e. easily computable) map f : {0,1}∗ onto −→ {tautologies} Where {tautologies} is just the set of propositional tautologies, and if f(x) = A then x is the proof of the propositional tautology A. A proof system is polynomially bounded if there exists a polynomial p such that for every A ∈ {tautologies}, there exists an x such that |x| ≤ p(|A|), i.e. ev...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notre Dame Journal of Formal Logic
سال: 1968
ISSN: 0029-4527
DOI: 10.1305/ndjfl/1093893412